Robust profile decomposition for large extragalactic spectral-line surveys
نویسندگان
چکیده
منابع مشابه
Deep Extragalactic X-ray Surveys
Deep surveys of the cosmic X-ray background are reviewed in the context of observational progress enabled by the Chandra X-ray Observatory and the X-ray Multi-Mirror Mission-Newton. The sources found by deep surveys are described along with their redshift and luminosity distributions, and the effectiveness of such surveys at selecting active galactic nuclei (AGN) is assessed. Some key results f...
متن کاملSurveys of Extragalactic Sources with Planck
Although the primary goal of ESA’s Planck mission is to produce high resolution maps of the temperature and polarization anisotropies of the Cosmic Microwave Background (CMB), its high-sensitivity all-sky surveys of extragalactic sources at 9 frequencies in the range 30–860 GHz will constitute a major aspect of its science products. In particular, Planck surveys will provide key information on ...
متن کاملGravitational lensing statistics with extragalactic surveys
We present constraints on the cosmological constant λ0 and the density parameter Ω0 from joint constraints from the analyses of gravitational lensing statistics of the Jodrell Bank-VLA Astrometric Survey (JVAS), optical gravitational lens surveys from the literature and CMB anisotropies. This is the first time that quantitative joint constraints involving lensing statistics and CMB anisotropies...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملAccelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 2019
ISSN: 0035-8711,1365-2966
DOI: 10.1093/mnras/stz710